The Postal Network: A Versatile Interconnection Topology

نویسندگان

  • Jie Wu
  • Yuanyuan Yang
چکیده

The postal network is an interconnection network that possesses many desirable properties which are important in network design and applications. It includes hypercubes and Fibonacci cubes as its special cases. The postal network can also be considered as a flexible version of the hypercube which relaxes the restriction on the number of nodes and thus makes it possible to construct multicomputers with arbitrary sizes. Basically, the postal network forms a series (with series number ) that is based on the sequence N (n) = N (n 1) + N (n ), where n is the dimension and N (n) represents the number of nodes in an n-dimensional postal network in series . In this paper, we study topological properties of postal networks and relationships between different postal networks. One application of postal networks is also shown in implementing barrier synchronization using a special spanning tree called a postal tree.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks

Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...

متن کامل

Performance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks

Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...

متن کامل

On Recurrent and Recursive Interconnection Patterns

A number of trivalent graphs, in particular variants of the cube-connected cycles and shuffle-exchange, have become popular as interconnection patterns for synchronous parallel computers. We consider highly-structured interconnection patterns that allow large parallel machines to be constructed from isomorphic copies of smaller ones, plus (perhaps) a few extra processors. If only a small number...

متن کامل

Determining which Fibonacci (p, r)-cubes can be Z-transformation graphs

The Fibonacci (p, r)-cube is an interconnection topology, which includes a wide range of connection topologies as its special cases, such as the Fibonacci cube, the postal network, etc. Klavžar and Žigert [S. Klavžar, P. Žigert, Fibonacci cubes are the resonance graphs of fibonaccenes, Fibonacci Quart. 43 (2005) 269–276] proved that Fibonacci cubes are just the Z-transformation graphs (also cal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998